Enhanced Algorithms for Multi-site Scheduling
نویسندگان
چکیده
This paper discusses two approaches to enhance multi-site scheduling for grid environments. First the potential improvements of multi-site scheduling by applying constraints for the job fragmentation are presented. Subsequently, an adaptive multi-site scheduling algorithm is pointed out and evaluated. The adaptive multi-site scheduling uses a simple decision rule whether to use or not to use multi-site scheduling. To this end, several machine configurations have been simulated with different parallel job workloads which were extracted from real traces. The adaptive system improves the scheduling results in terms of a short average response time significantly.
منابع مشابه
A heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملDevelopment of a Set of Algorithms for the Multi-Project Scheduling Problems
In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملOptimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms
The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...
متن کاملA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کامل